A Fully Scalable Parallel Algorithm for Solving Elliptic Partial Differential Equations
نویسندگان
چکیده
A comparison is made between the probabilistic domain decomposition (DD) method and a certain deterministic DD method for solving linear elliptic boundary-value problems. Since in the deterministic approach the CPU time is affected by intercommunications among the processors, it turns out that the probabilistic method performs better, especially when the number of subdomains (hence, of processors) is increased. This fact is clearly illustrated by some examples. The probabilistic DD algorithm has been implemented in an MPI environment, in order to exploit distributed computer architectures. Scalability and fault-tolerance of the probabilistic DD algorithm are emphasized.
منابع مشابه
A numerical method for solving nonlinear partial differential equations based on Sinc-Galerkin method
In this paper, we consider two dimensional nonlinear elliptic equations of the form $ -{rm div}(a(u,nabla u)) = f $. Then, in order to solve these equations on rectangular domains, we propose a numerical method based on Sinc-Galerkin method. Finally, the presented method is tested on some examples. Numerical results show the accuracy and reliability of the proposed method.
متن کاملPerturbation-Iteration Algorithm for Solving Heat and Mass Transfer in the Unsteady Squeezing Flow between Parallel Plates
In this paper, heat and mass transfer in the unsteady squeezing flow between parallel plates is analyzed using a perturbation-iteration algorithm. The similarity transformation is used to transform the governing partial differential equations into ordinary differential equations, before being solved. The solutions of the velocity, temperature and concentration are derived and sketched to explai...
متن کاملFinite difference method for solving partial integro-differential equations
In this paper, we have introduced a new method for solving a class of the partial integro-differential equation with the singular kernel by using the finite difference method. First, we employing an algorithm for solving the problem based on the Crank-Nicholson scheme with given conditions. Furthermore, we discrete the singular integral for solving of the problem. Also, the numerical results ob...
متن کاملA Composite Finite Difference Scheme for Subsonic Transonic Flows (RESEARCH NOTE).
This paper presents a simple and computationally-efficient algorithm for solving steady two-dimensional subsonic and transonic compressible flow over an airfoil. This work uses an interactive viscous-inviscid solution by incorporating the viscous effects in a thin shear-layer. Boundary-layer approximation reduces the Navier-Stokes equations to a parabolic set of coupled, non-linear partial diff...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کامل